翻訳と辞書
Words near each other
・ Simplicia inareolalis
・ Simplicia inflexalis
・ Simplicia mistacalis
・ Simplicial approximation theorem
・ Simplicial category
・ Simplicial commutative ring
・ Simplicial complex
・ Simplicial group
・ Simple Pleasure
・ Simple Pleasures
・ Simple Pleasures (Alison Brown album)
・ Simple Pleasures (Bobby McFerrin album)
・ Simple polygon
・ Simple polytope
・ Simple Power
Simple precedence grammar
・ Simple precedence parser
・ Simple present
・ Simple prioritization
・ Simple programmable logic device
・ Simple public-key infrastructure
・ Simple random sample
・ Simple rational approximation
・ Simple resolution
・ Simple ring
・ Simple Science
・ Simple Sensor Interface protocol
・ Simple sequence length polymorphism
・ Simple series
・ Simple Service Discovery Protocol


Dictionary Lists
翻訳と辞書 辞書検索 [ 開発暫定版 ]
スポンサード リンク

Simple precedence grammar : ウィキペディア英語版
Simple precedence grammar
A simple precedence grammar is a context-free formal grammar that can be parsed with a simple precedence parser.〔
The Theory of Parsing, Translation, and Compiling: Compiling, Alfred V. Aho, Jeffrey D. Ullman, Prentice–Hall, 1972.〕 The concept was first developed by Niklaus Wirth and Helmut Weber from the ideas of Robert Floyd in their paper, ''EULER: a generalization of ALGOL, and its formal definition'', in the Communications of the ACM in 1966.
==Formal definition==

G = (''N'', Σ, ''P'', ''S'') is a simple precedence grammar if all the production rules in ''P'' comply with the following constraints:
* There are no erasing rules (ε-productions)
* There are no useless rules (unreachable symbols or unproductive rules)
* For each pair of symbols ''X'', ''Y'' (''X'', ''Y'' \in (''N'' ∪ Σ)) there is only one Wirth–Weber precedence relation.
* G is uniquely inversible

抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)
ウィキペディアで「Simple precedence grammar」の詳細全文を読む



スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース

Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.